Complete Boolean algebra - PDFSEARCH.IO - Document Search Engine

Complete Boolean algebra
Results: 108

#	Item
31	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
32	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 8 Lower Bounds for Linear Satisfiability Problems ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 1999-10-13 17:17:56 Computational complexity theory Abstract algebra Linear algebra NP-complete problems Logic in computer science Boolean satisfiability problem Time complexity PP Element distinctness problem Theoretical computer science Mathematics Algebra
33	Sector Partnership (SP) National Emergency Grant (NEG) NEG Electronic Application System (eSystem) User Guide Complete applications must be received by 11:59 PM EDT on May 29, 2015 Add to Reading List Source URL: www.doleta.gov Language: English - Date: 2015-05-07 12:03:18 Logic in computer science Automated theorem proving Boolean algebra Rules of inference
34	Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University May 23, 2008 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-12 00:13:50 Complexity classes Boolean algebra Constraint programming Mathematical optimization Boolean satisfiability problem Constraint satisfaction problem NP-complete Belief propagation NP Theoretical computer science Computational complexity theory Applied mathematics
35	Refutation-Complete Binary Decision Diagrams Scott P. Sanner Department of Computer Science University of Toronto Toronto, ON M5S 3G4 Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2004-05-05 19:58:06 Boolean algebra Automated theorem proving Constraint programming Mathematical logic Diagrams Binary decision diagram DPLL algorithm Boolean satisfiability problem Resolution Theoretical computer science Mathematics Applied mathematics
36	Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:31:27 Boolean algebra Symmetry Logic in computer science NP-complete problems Electronic design automation Boolean satisfiability problem True quantified Boolean formula Conjunctive normal form Symmetry in mathematics Theoretical computer science Mathematics Applied mathematics
37	Solutions to Selected Exercises (A complete solutions manual is available for instructors. Requests should be made on official letterhead directly to the author at the Department of Philosophy, Tulane University, New Orl Add to Reading List Source URL: spot.colorado.edu Language: English - Date: 2001-01-11 15:24:37 Propositional calculus Semantics Boolean algebra Binary operations If and only if Truth table Logical biconditional Tautology Interpretation Mathematics Logic Abstract algebra
38	Using a satisfiability solver to identify deterministic finite state automata Marijn J.H. Heule Sicco Verwer Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-08-19 05:30:10 NP-complete problems Complexity classes Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Graph coloring SL NP-complete Theoretical computer science Mathematics Computational complexity theory
39	Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345 Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 01:10:58 Automated theorem proving Boolean algebra NP-complete problems Constraint programming Logic in computer science Boolean satisfiability problem Davis–Putnam algorithm Satisfiability Unit propagation Theoretical computer science Mathematics Computational complexity theory
40	On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas ˇ ˇ Ondˇrej Cepek and Stefan Add to Reading List Source URL: www.cs.uic.edu Language: English - Date: 2013-12-21 14:10:02 Logic in computer science Boolean algebra Complexity classes NP-complete problems Conjunctive normal form Computational problems 2-satisfiability Boolean satisfiability problem Disjunctive normal form Theoretical computer science Computational complexity theory Applied mathematics

UPDATE